A simple, faster method for kinetic proximity problems
نویسندگان
چکیده
For a set of n points in the plane, this paper presents simple kinetic data structures (KDS’s) for solutions to some fundamental proximity problems, namely, the all nearest neighbors problem, the closest pair problem, and the Euclidean minimum spanning tree (EMST) problem. Also, the paper introduces KDS’s for maintenance of two well-studied sparse proximity graphs, the Yao graph and the Semi-Yao graph. We use sparse graph representations, the Pie Delaunay graph and the Equilateral Delaunay graph, to provide new solutions for the proximity problems. Then we design KDS’s that efficiently maintain these sparse graphs on a set of n moving points, where the trajectory of each point is assumed to be a polynomial function of constant maximum degree s. We use the kinetic Pie Delaunay graph and the kinetic Equilateral Delaunay graph to create KDS’s for maintenance of the Yao graph, the Semi-Yao graph, all the nearest neighbors, the closest pair, and the EMST. Our KDS’s use O(n) space and O(n log n) preprocessing time. We provide the first KDS’s for maintenance of the Semi-Yao graph and the Yao graph. Our KDS processes O(nβ2s+2(n)) (resp. O(n β 2s+2(n) log n)) events to maintain the Semi-Yao graph (resp. the Yao graph); each event can be processed in time O(log n) in an amortized sense. Here, βs(n) = λs(n)/n is an extremely slow-growing function and λs(n) is the maximum length of Davenport-Schinzel sequences of order s on n symbols. Our KDS for maintenance of all the nearest neighbors and the closest pair processes O(nβ 2s+2(n) log n) events. For maintenance of the EMST, our KDS processes O(nβ 2s+2(n) log n) events. For all three of these problems, each event can be handled in time O(log n) in an amortized sense. Our deterministic kinetic approach for maintenance of all the nearest neighbors improves by an O(log n) factor the previous randomized kinetic algorithm by Agarwal, Kaplan, and Sharir. Furthermore, our KDS is simpler than their KDS, as we reduce the problem to one-dimensional range searching, as opposed to using two-dimensional range searching as in their KDS. For maintenance of the EMST, our KDS improves the previous KDS by Rahmati and Zarei by a near-linear factor in the number of events.
منابع مشابه
Mathematical Modeling of Flow in a Granular Permeable Bed Channel
In this research, a two-dimensional mathematical model using turbulence model was developed in a rectangular channel with granular permeable bed. Finite volume method was used for numerical solution of governing equations. The equations considered are discretized using Hybrid difference scheme while applying SIMPLE algorithm to correct velocity components in the continuity equation. In the dev...
متن کاملA simple approach to the two-dimensional guillotine cutting stock problem
Cutting stock problems are within knapsack optimization problems and are considered as a non-deterministic polynomial-time (NP)-hard problem. In this paper, two-dimensional cutting stock problems were presented in which items and stocks were rectangular and cuttings were guillotine. First, a new, practical, rapid, and heuristic method was proposed for such problems. Then, the ...
متن کاملBroad-spectrum kinetic resolution of alcohols enabled by Cu–H-catalysed dehydrogenative coupling with hydrosilanes
The enantioselective silylation of racemic alcohols, where one enantiomer reacts faster than the other, is an alternative approach to established enzymatic and non-enzymatic acylation techniques. The existing art is either limited to structurally biased alcohols or requires elaborate catalysts. Simple substrates, such as benzylic and allylic alcohols, with no coordinating functionality in the p...
متن کاملRoughening due to edge diffusion for irreversible aggregation
We show that fast edge diffusion in a simple kinetic Monte Carlo simulation for epitaxial growth enhances surface roughening for a model of irreversible aggregation. The reason for this is a simple, but rather subtle effect: Faster edge diffusion makes the islands more compact, leading to a significant adatom concentration on top of islands at earlier times. As a consequence, nucleation in high...
متن کاملTrace Amounts Determination of Vanadium (V) Using a New Kinetic-Catalytic Reaction System
This study describes a new simple, sensitive and selective catalytic kinetic spectrophotometricmethod for the determination of vanadium (V). The method is based upon the catalytic effect ofvanadium (V) on the oxidation of Carminic acid by bromate in sulfuric acid media. The reaction wasfollowed spectrophotometrically by measuring the decrease in absorbance at 490 nm and thedependence of sensiti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 48 شماره
صفحات -
تاریخ انتشار 2015